Local Search Algorithms for Multi-criteria Single Machine Scheduling Problem
نویسندگان
چکیده
منابع مشابه
GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کاملLocal search algorithms for a single-machine scheduling problem with positive and negative time-lags
Positive and negative time-lags are general timing restrictions between the starting times of jobs which have been introduced in connection with the Metra Potential Method. Although very powerful, these relations have been considered only seldom in the literature since already for a single machine problem with positive and negative time-lags the problem of finding a feasible solution is NP-comp...
متن کاملMulti-objective Variable Neighborhood Search Algorithms for a Single Machine Scheduling Problem with Distinct due Windows
In this paper, we compare three multi-objective algorithms based on Variable Neighborhood Search (VNS) heuristic. The algorithms are applied to solve the single machine scheduling problem with sequence dependent setup times and distinct due windows. In this problem, we consider minimizing the total weighted earliness/tardiness and the total flowtime criteria. We introduce two intensification pr...
متن کاملA Mathematical Model of a Multi-Criteria Parallel Machine Scheduling Problem: a Genetic Algorithm (RESEARCH NOTE)
.
متن کاملOn-line Algorithms for a Single Machine Scheduling Problem
An increasingly significant branch of computer science is the study of on-line algorithms. In this paper, we apply the theory of on-line algorithms to job scheduling. In particular, we study the nonpreemptive single machine scheduling of independent jobs with arbitrary release dates to minimize the total completion time. We design and analyze two on-line algorithms which make scheduling decisio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ibn AL- Haitham Journal For Pure and Applied Science
سال: 2018
ISSN: 2521-3407,1609-4042
DOI: 10.30526/2017.ihsciconf.1817